Successive Concave Sparsity Approximation for Compressed Sensing
نویسندگان
چکیده
منابع مشابه
Successive Concave Sparsity Approximation: Near-Oracle Performance in a Wide Range of Sparsity Levels
In this paper, based on a successively accuracyincreasing approximation of the `0 norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measurements. The approximations are realized with a certain class of concave functions that aggressively induce sparsity and their closeness to the `0 norm can be controlled. We prove that the series of the approximations asympto...
متن کاملJoint Sparsity Models for Distributed Compressed Sensing
Compressed sensing is an emerging field based on the revelation that a small group of linear projections of a sparse signal contains enough information for reconstruction. In this paper we introduce a new theory for distributed compressed sensing (DCS) that enables new distributed coding algorithms for multi-signal ensembles that exploit both intraand inter-signal correlation structures. The DC...
متن کاملSparsity Pattern Recovery in Compressed Sensing
Sparsity Pattern Recovery in Compressed Sensing by Galen Reeves Doctor of Philosophy in Engineering — Electrical Engineering and Computer Sciences University of California, Berkeley Professor Michael Gastpar, Chair The problem of recovering sparse signals from a limited number of measurements is now ubiquitous in signal processing, statistics, and machine learning. A natural question of fundame...
متن کاملCompressed Sensing: “When sparsity meets sampling”∗
The recent theory of Compressed Sensing (Candès, Tao & Romberg, 2006, and Donoho, 2006) states that a signal, e.g. a sound record or an astronomical image, can be sampled at a rate much smaller than what is commonly prescribed by Shannon-Nyquist. The sampling of a signal can indeed be performed as a function of its “intrinsic dimension” rather than according to its cutoff frequency. This chapte...
متن کاملEstimating Unknown Sparsity in Compressed Sensing
In the theory of compressed sensing (CS), the sparsity ‖x‖0 of the unknown signal x ∈ R is commonly assumed to be a known parameter. However, it is typically unknown in practice. Due to the fact that many aspects of CS depend on knowing ‖x‖0, it is important to estimate this parameter in a data-driven way. A second practical concern is that ‖x‖0 is a highly unstable function of x. In particular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2016
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2016.2585096